Evolution of Migrating Planets Undergoing Gas Accretion

We analyze the orbital and mass evolution of planets that undergo run-away gas accretion by means of 2D and 3D hydrodynamic simulations. The disk torque distribution per unit disk mass as a function of radius provides an important diagnostic for the nature of the disk-planet interactions. We first consider torque distributions for nonmigrating planets of fixed mass and show that there is general agreement with the expectations of resonance theory. We then present results of simulations for mass-gaining, migrating planets. For planets with an initial mass of 5 Earth masses, which are embedded in disks with standard parameters and which undergo run-away gas accretion to one Jupiter mass (Mjup), the torque distributions per unit disk mass are largely unaffected by migration and accretion for a given planet mass. The migration rates for these planets are in agreement with the predictions of the standard theory for planet migration (Type I and Type II migration). The planet mass growth occurs through gas capture within the planet's Bondi radius at lower planet masses, the Hill radius at intermediate planet masses, and through reduced accretion at higher planet masses due to gap formation. During run-away mass growth, a planet migrates inwards by only about 20% in radius before achieving a mass of ~1 Mjup. For the above models, we find no evidence of fast migration driven by coorbital torques, known as Type III migration. We do find evidence of Type III migration for a fixed mass planet of Saturn's mass that is immersed in a cold and massive disk. In this case the planet migration is assumed to begin before gap formation completes. The migration is understood through a model in which the torque is due to an asymmetry in density between trapped gas on the leading side of the planet and ambient gas on the trailing side of the planet.Comment: 26 pages, 29 figures. To appear in The Astrophysical Journal vol.684 (September 20, 2008 issue

Hierarchical structuring of Cultural Heritage objects within large aggregations

Huge amounts of cultural content have been digitised and are available through digital libraries and aggregators like Europeana.eu. However, it is not easy for a user to have an overall picture of what is available nor to find related objects. We propose a method for hier- archically structuring cultural objects at different similarity levels. We describe a fast, scalable clustering algorithm with an automated field selection method for finding semantic clusters. We report a qualitative evaluation on the cluster categories based on records from the UK and a quantitative one on the results from the complete Europeana dataset.Comment: The paper has been published in the proceedings of the TPDL conference, see http://tpdl2013.info. For the final version see http://link.springer.com/chapter/10.1007%2F978-3-642-40501-3_2

Cast-as-Intended Mechanism with Return Codes Based on PETs

We propose a method providing cast-as-intended verifiability for remote electronic voting. The method is based on plaintext equivalence tests (PETs), used to match the cast ballots against the pre-generated encrypted code tables. Our solution provides an attractive balance of security and functional properties. It is based on well-known cryptographic building blocks and relies on standard cryptographic assumptions, which allows for relatively simple security analysis. Our scheme is designed with a built-in fine-grained distributed trust mechanism based on threshold decryption. It, finally, imposes only very little additional computational burden on the voting platform, which is especially important when voters use devices of restricted computational power such as mobile phones. At the same time, the computational cost on the server side is very reasonable and scales well with the increasing ballot size

Optimal Contracts for Outsourced Computation

While expensive cryptographically verifiable computation aims at defeating malicious agents, many civil purposes of outsourced computation tolerate a weaker notion of security, i.e., “lazy-but-honest” contractors. Targeting this type of agents, we develop optimal contracts for outsourcing of computational tasks via appropriate use of rewards, punishments, auditing rate, and “redundancy”. Our contracts provably minimize the expense of the outsourcer (principal) while guaranteeing correct computation. Furthermore, we incorporate practical restrictions of the maximum enforceable fine, limited and/or costly auditing, and bounded budget of the outsourcer. By examining the optimal contracts, we provide insights on how resources should be utilized when auditing capacity and enforceability are limited. Finally, we present a light-weight cryptographic implementation of the contracts and discuss a comparison across different implementations of auditing in outsourced computation